Enhancing Constraints Manipulation in Semiring-Based Formalisms
نویسندگان
چکیده
Many “semiring-like” structures are used in Soft Constraint Satisfaction Problems (SCSPs). We review a few properties of semirings that are useful for dealing with soft constraints, highlighting the differences between alternative proposals in the literature. We then extend the semiring structure by adding the notion of division as a weak inverse operation of product. In particular, division is needed to apply constraint relaxation when the product operation of the semiring is not idempotent. The division operator is introduced via residuation and it is also able to deal with partial orders, generalizing the approach given for Valued CSPs.
منابع مشابه
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent’s preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One class of soft constraints formalisms, semiring-based CSPs, allows a partially ordered set of preference degrees, but this set must form a distributive lattice; whilst this is convenient computationally, it considerably restric...
متن کاملBounds and Pre-processing for Local Computation of Semiring Valuations
Local Computation based on hypertree/join tree decompositions [10, 8, 5, 7] is a very general computational framework which leads to effective computational procedures in many different formalisms. The inputs are a multiset of objects called valuations. Each valuation is associated with a set of variables (its scope). In this paper we focus on semiring valuations: they are functions from the pr...
متن کاملEncoding global constraints in semiring-based constraint solving
In recent works, a general framework for constraint satisfaction over nite domains has been proposed, based on the concept of semiring-valued constraints. Classical CSPs, fuzzy CSPs, hierachical CSPs can be easily cast in this general framework. In this paper, we claim that translating any constraint problem into a semiring-based constraint problem makes it possible to express global in-formati...
متن کاملCoordinating Asynchronous and Open Distributed Systems under Semiring-Based Timing Constraints
For asynchronous and open distributed systems, dynamicity, openness, and stringent quality of service requirements post great challenges to model and develop such systems. The Actor-Role-Coordinator (ARC) model was previously proposed to address these challenges. The role concept in the model attends to the dynamicity and openness issues by providing abstractions of actor behaviors. In this pap...
متن کاملSoft constraint abstraction based on semiring homomorphism
The semiring-based constraint satisfaction problems (semiring CSPs), proposed by Bistarelli, Montanari and Rossi [3], is a very general framework of soft constraints. In this paper we propose an abstraction scheme for soft constraints that uses semiring homomorphism. To find optimal solutions of the concrete problem, the idea is, first working in the abstract problem and finding its optimal sol...
متن کامل